General constructions for information-theoretic private information retrieval
نویسندگان
چکیده
منابع مشابه
General constructions for information-theoretic private information retrieval
A Private Information Retrieval (PIR) protocol enables a user to retrieve a data item from a database while hiding the identity of the item being retrieved; specifically, in a t-private, k-server PIR protocol the database is replicated among k servers, and the user’s privacy is protected from any collusion of up to t servers. The main cost-measure of such protocols is the communication complexi...
متن کاملConstructions for efficient Private Information Retrieval protocols
Private Information Retrieval (PIR) protocols aim at ensuring a user that he can retrieve some part Di of a distributed database D without revealing the index i to the server(s). Most of known PIR protocols focus on decreasing the communication complexity between the client and the server(s). Recently, the use of PIR codes by Fazeli et. al. also lead to a huge reduction of the storage overhead ...
متن کاملBreaking the Barrier for Information-Theoretic Private Information Retrieval
Private Information Retrieval (PIR) protocols allow a user to retrieve a data item from a database while hiding the identity of the item being retrieved. Specifically, in information-theoretic, -server PIR protocols the database is replicated among servers, and each server learns nothing about the item the user retrieves. The cost of such protocols is measured by the communication complexity of...
متن کاملInformation-Theoretic Private Information Retrieval: A Unified Construction
A Private Information Retrieval (PIR) protocol enables a user to retrieve a data item from a database while hiding the identity of the item being retrieved. In a t-private, k-server PIR protocol the database is replicated among k servers, and the user’s privacy is protected from any collusion of up to t servers. The main cost-measure of such protocols is the communication complexity of retrievi...
متن کاملImproved Upper Bounds on Information-theoretic Private Information Retrieval
Private Information Retrieval (PIR) schemes allow a user to retrieve the i-th bit of an n-bit database x, replicated in k servers, while keeping the value of i private from each server. A t-private PIR scheme protects the user's privacy from any collusion of up to t servers. The main cost measure for such schemes is their communication complexity. We introduce a new technique for the constructi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2005
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2005.03.002